//
// Created by Jisam on 24/08/2024 8:32 PM.
// Solution of  P4995 跳跳！
//#pragma GCC optimize(3)
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#include<climits>

using namespace std;

#define endl "\n"
#define PSI pair<string,int>
#define PII pair<int,int>
#define PDI pair<double,int>
#define PDD pair<double,double>
#define VVI vector<vector<int>>
#define VI vector<int>
#define VS vector<string>

#define PQLI priority_queue<int, vector<int>, less<int>>
#define PQGI priority_queue<int, vector<int>, greater<int>>
#define code_by_jisam ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
using namespace std;
using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128;
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1,};
int dy[] = {0, 0, -1, 1, 1, -1, -1, 1,};

void solution() {
    int n;
    cin >> n;
    VI a(n + 1) ;
    a[0] = 0;
    for (auto &x: a) {
        cin >> x;
    }
    sort(a.begin(),a.end());

    int i = 0,j = n;
    i64 sum = 0;
    while(i < j){
        sum += (a[j] - a[i]) *  (a[j] - a[i]);
        i ++;
        sum += (a[j] - a[i]) *  (a[j] - a[i]);
        j --;
    }
    cout << sum <<endl;

}

int main() {
    code_by_jisam;
    int T = 1;
//    cin >> T;
    while (T--) {
        solution();
    }
    return 0;
}